Stationary analysis of the shortest queue first service policy
نویسندگان
چکیده
منابع مشابه
Stationary analysis of the shortest queue first service policy
We analyze the so-called Shortest Queue First (SQF) queueing discipline whereby a unique server addresses queues in parallel by serving at any time that queue with the smallest workload. Considering a stationary system composed of two parallel queues and assuming Poisson arrivals and general service time distributions, we first establish the functional equations satisfied by the Laplace transfo...
متن کاملStationary analysis of the "Shortest Queue First" service policy: the asymmetric case
As a follow-up to a recent paper considering two symmetric queues, the Shortest Queue First service discipline is presently analysed for two general asymmetric queues. Using the results previously established and assuming exponentially distributed service times, the bivariate Laplace transform of workloads in each queue is shown to depend on the solution M to a two-dimensional functional equati...
متن کاملApproximate analysis of a fault-tolerant join-the-shortest-queue policy
In distributed or multi-processor systems, the join the shortest queue (JSQ) scheduling policy can provide competitive performance compared to other heuristic policies. However, processing nodes can fail. In order to provide fault tolerance, one proposed solution is using a “buddy system”. We investigate a new scheduling system by combining these two methods together to provide good performance...
متن کاملAnalysis of an M/G/1 Queue with Multiple Vacations, N-policy, Unreliable Service Station and Repair Facility Failures
This paper studies an M/G/1 repairable queueing system with multiple vacations and N-policy, in which the service station is subject to occasional random breakdowns. When the service station breaks down, it is repaired by a repair facility. Moreover, the repair facility may fail during the repair period of the service station. The failed repair facility resumes repair after completion of its re...
متن کاملQueue Length Analysis of a Markov-modulated Vacation Queue with Dependent Arrival and Service Processes and Exhaustive Service Policy
The paper introduces a class of vacation queues where the arrival and service processes are modulated by the same Markov process, hence they can be dependent. The main result of the paper is the probability generating function for the number of jobs in the system. The analysis follows a matrix-analytic approach. A step of the analysis requires the evaluation of the busy period of a quasi birth ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Queueing Systems
سال: 2013
ISSN: 0257-0130,1572-9443
DOI: 10.1007/s11134-013-9383-5